# -*- coding: UTF-8 -*-
from typing import List
from leetcode_helper import TestcaseHelper, SolutionBase, Stack


class Solution(SolutionBase):
    # 解题的方法，命名和Leetcode的保持一致即可
    def longestValidParentheses(self, s: str) -> int:
        def merge_number(stack, count):
            while stack.size():
                temp = stack.pop()
                if temp.isdigit():
                    count += int(temp)
                else:
                    stack.push(temp)
                    break
            stack.push(str(count))
            return count

        stack = Stack()

        ans = 0
        for ch in s:
            if ch == ")":
                count = 0
                if stack.size() > 0:
                    top = stack.pop()
                    if top == '(':
                        count += 2
                        count = merge_number(stack, count)
                        ans = max(count, ans)
                    elif top.isdigit():
                        count += int(top)
                        if stack.size() > 0:
                            temp = stack.pop()
                            if temp == '(':
                                count += 2
                                ans = max(count, ans)
                                stack.push(str(count))
                                count = 0
                                count = merge_number(stack, count)
                                ans = max(count, ans)
                            else:
                                stack.push(temp)
                    else:
                        stack.push(top)
            else:
                stack.push(ch)

        return ans


if __name__ == '__main__':
    solution = Solution()

    # 按照leetcode的题目说明，将基本的test case填入
    # 每条case的最后一个元素是正确的结果，即期待的结果
    # 使用元组来保存输入的数据，期待的结果
    testcases = [
        ("()(())", 6),
        ("(()", 2),
        (")()())", 4),
        ("", 0)
    ]

    for case_item in testcases:
        # 获取测试用的case和期待的执行结果
        input1 = case_item[0]

        expect = case_item[len(case_item) - 1]

        exec_result = solution.longestValidParentheses(input1)

        # 判断执行结果，输出提示信息
        check_result = solution.check_result(expect, exec_result)
        TestcaseHelper.print_case(check_result, case_item, exec_result)

